﻿package DynamicProgramming;

/**
 * @ClassName LC983
 * @Description TODO
 * @Author ZJX
 * @Date 2024/11/1 20:07
 * @Version 1.0
 */
public class LC983 {
    public int mincostTickets(int[] days, int[] costs) {
        int n = days.length;
        int[] dp = new int[n + 1];
//        d[i] 表示 前i天花费的钱
//        左程云的太难了
        return -1;
    }
}
